A Theory of Satis cing Control A

نویسندگان

  • Michael A. Goodrich
  • Richard L. Frost
  • Todd K. Moon
  • A. Lee Swindlehurst
  • David J. Comer
  • Wynn C. Stirling
چکیده

The existence of an optimal control policy and the techniques for nding it are grounded fundamentally in a superlative perspective. These techniques can be of limited value when the global behavior of the system is diicult to characterize , as it may be when the system is nonlinear, when the input is constrained, or when only partial information is available regarding system dynamics or the environment. Satisscing control theory is an alternative approach that is compatible with such systems. This theory is extended by the introduction of the notion of strongly satisscing to provide a rigorous, systematic procedure for the design of satisscing controllers which are consistent with optimal control theory. Because they are often diicult to solve optimally, one application of satisscing control theory is to nonlinear control problems. Of particular interest are the nonlinear quadratic regulator and nonlinear minimum time problems. A controller synthesis procedure and resulting solutions are presented for single agent nonlinear control problems. The application of the satisscing principle to single agent control problems establishes the validity of the principle in a control setting, and motivates its use in multiple agent problems. Multiple agent control problems have proven diicult to solve using classical control methods. Agents may disagree about what constitutes optimality and, even if they agree, an optimal solution may be unknown or computationally impractical. These diiculties are to a signiicant degree resolved by applying sat-isscing control theory. A controller synthesis procedure is developed for a general three-team problem with pursuit-evasion and nonlinear regulator characteristics. Simulations demonstrate that the resulting controllers not only perform well in both cooperative and non-cooperative environments, but also that performance degrades gracefully in the presence of partial information. ii DEDICATION To my sweetheart Patricia and our sons Daniel and David iii ACKNOWLEDGEMENTS

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonlinear Robust Regulation Using the Satis cing Paradigm

In this paper we use the recently introduced concept of satis cing decision theory to develop robustly stabilizing state-feedback control strategies for nonlinear systems subject to unknown disturbances. The result is a point-wise \input-to-state satis cing" set of control options from which a continuous feedback strategy can be selected. We show that every input-tostate satis cing control also...

متن کامل

Nonlinear Robust Regulation Using the Satis cing

In this paper we use the recently introduced concept of satis cing decision theory to develop robustly stabilizing state-feedback control strategies for nonlinear systems subject to unknown disturbances. The result is a point-wise \input-to-state satis cing" set of control options from which a continuous feedback strategy can be selected. We show that every input-tostate satis cing control also...

متن کامل

St. Bernard: the File Retrieving Softbot

There is a need to empirically validate theoretical Machine Learning research. This can be di cult because the algorithms being tested often require large amounts of training data. Softbots provide a unique solution to this problem. Softbots or software robots are intelligent agents that interact with software environments. By attaching the agent directly to the training environment, it is poss...

متن کامل

Satis cing and Stochastic Choice

Satis cing is a hugely in uential model of boundedly rational choice, yet it cannot be easily tested using standard choice data. We develop necessary and su cient conditions for stochastic choice data to be consistent with satis cing, assuming that preferences are xed, but search order may change randomly. The model predicts that stochastic choice can only occur amongst elements that are always...

متن کامل

A Satis£cing Approach to Assigning Vehicles to Targets

Determining which of N -agents are assigned to which of M -tasks is order M in complexity. By requiring individual agents to identify the set of individually satis£cing actions, this complexity remains exponential but can be signi£cantly reduced. We present an algorithm for identifying individually satis£cing choices in a problem where agents must reach a target while avoiding threats. We demon...

متن کامل

Naive Bayes as a Satis cing Model

We report on an empirical study of supervised learning algorithms that induce models to resolve the meaning of ambiguous words in text. We nd that the Naive Bayesian classi er is as accurate as several more sophisticated methods. This is a surprising result since Naive Bayes makes simplifying assumptions about disambiguation that are not realistic. However, our results correspond to a growing b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996